Context-free language - PDFSEARCH.IO - Document Search Engine

Context-free language
Results: 272

#	Item
51	JMLR: Workshop and Conference Proceedings 34:139–152, 2014 Proceedings of the 12th ICGI Grammatical Inference of some Probabilistic Context-Free Grammars from Positive Data using Minimum Satisfiability Add to Reading List Source URL: jmlr.org Language: English - Date: 2014-08-26 06:56:50 Grammar Context-free grammar Stochastic context-free grammar Chomsky normal form Formal grammar CYK algorithm LL parser Regular language Grammar induction Formal languages Linguistics Logic
52	JMLR: Workshop and Conference Proceedings 34:49–63, 2014 Proceedings of the 12th ICGI A bottom-up efficient algorithm learning substitutable languages from positive examples Add to Reading List Source URL: jmlr.org Language: English - Date: 2014-08-26 06:56:50 Software engineering String Regular language Context-free grammar Formal grammar Regular expression Algorithm Formal languages Combinatorics Mathematics
53	JMLR: Workshop and Conference Proceedings 34:21–32, 2014 Proceedings of the 12th ICGI Towards a rationalist theory of language acquisition Edward Stabler Add to Reading List Source URL: jmlr.org Language: English - Date: 2014-08-26 06:56:50 Combinatorics Regular language Poverty of the stimulus Formal grammar Context-free grammar Language acquisition Verb phrase Universal grammar Parsing Formal languages Linguistics Language
54	JMLR: Workshop and Conference Proceedings 34:193–206, 2014 Proceedings of the 12th ICGI Evaluation of selection in context-free grammar learning systems Add to Reading List Source URL: jmlr.org Language: English - Date: 2014-08-26 06:56:50 Linguistics Natural language processing Information retrieval Evaluation of machine translation Precision and recall F1 score Treebank Recall Statistics Science Computational linguistics
55	Lexicalization in Crosslinguistic Probabilistic Parsing: The Case of French Abhishek Arun and Frank Keller School of Informatics, University of Edinburgh 2 Buccleuch Place, Edinburgh EH8 9LW, UK , kell Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2010-11-08 07:24:17 Corpus linguistics Speech recognition Statistical natural language processing Applied linguistics Treebank Stochastic context-free grammar Part-of-speech tagging Parsing International Corpus of English Linguistics Natural language processing Computational linguistics
56	Detecting Ambiguity in Programming Language Grammars Naveneetha Vasudevan and Laurence Tratt Software Development Team, King’s College London http://soft-dev.org/ Add to Reading List Source URL: soft-dev.org Language: English - Date: 2015-06-08 18:44:11 Software engineering Ambiguous grammar Context-free grammar Formal grammar Parsing LL parser Terminal and nonterminal symbols LR parser Parsing expression grammar Formal languages Grammar Programming language implementation
57	Morphology and Reranking for the Statistical Parsing of Spanish Brooke Cowan MIT CSAIL Abstract We present two methods for incorporating detailed features in a Spanish parser, Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2008-12-21 17:22:25 Corpus linguistics Statistical natural language processing Formal languages Treebank Part-of-speech tagging Parsing Parse tree Stochastic context-free grammar Statistical parsing Linguistics Natural language processing Computational linguistics
58	Using adaptor grammars to identify synergies in the unsupervised acquisition of linguistic structure Mark Johnson Brown University Mark Add to Reading List Source URL: www.aclweb.org Language: English - Date: 2010-06-15 03:19:37 Grammar Compiler construction Statistical natural language processing Corpus linguistics Stochastic context-free grammar Context-free grammar N-gram Parsing Formal grammar Linguistics Formal languages Science
59	ICS 162 – Fall 2003 – Midterm Name: Solution Key Student ID: 1: 30 Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2003-11-21 17:50:43 Mathematics Computer science Pumping lemma for regular languages Deterministic finite automaton Nondeterministic finite automaton Pumping lemma for context-free languages Regular language Regular expression String Formal languages Automata theory Theoretical computer science

UPDATE